@ARTICLE{candia17,
   AUTHOR = "Candia A.",
   TITLE = "{Problema de Steiner en redes I: Modelos Algoritmos}",
   JOURNAL = "ICHIO",
   YEAR = "2000",
   VOLUME = "87",
   NUMBER = "",
   MONTH = "",
   PAGES = "385--399"
}

@article{candia01,
 author = {Candia A. and Bravo H.},
 title = {Worst-case performance of {W}ong's {S}teiner tree heuristic},
 journal = {Discrete Appl. Math.},
 volume = {154},
 number = {5},
 year = {2006},
 issn = {0166-218X},
 pages = {730--737},
 doi = {http://dx.doi.org/10.1016/j.dam.2005.05.027},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
}

@Article{Prim57,
  author =       {Prim R. C.},
  title =        {Shortest connection networks and some generalizations.},
  journal =      {Bell Systems Technical Journal},
  pages =        {1389--1401},
  month =        nov,
  year =         {1957},
  keywords =     {jrnl, Prims, graph, graphs, network, minimum spanning
                 tree, MST, algorithm, c1957, c195x, c19xx},
}
@MISC{Esbensen95,
    author = {Esbensen H.},
    title = {Computing Near-Optimal Solutions to the {S}teiner Problem in a Graph Using a Genetic Algorithm},
    year = {1995}
}
@article{filogenia01,
title = "The {S}teiner problem in phylogeny is {NP}-complete",
journal = "Advances in Applied Mathematics",
volume = "3",
number = "1",
pages = "43 - 49",
year = "1982",
note = "",
issn = "0196-8858",
doi = "DOI: 10.1016/S0196-8858(82)80004-3",
url = "http://www.sciencedirect.com/science/article/B6W9D-4GJMRWH-4/2/86ee7a4020e32a03443cfa55f9e63c3d",
author = "Foulds L.~R. and Graham R.~L. "
}
@article{VLSI,
 author = {Gr\"{o}tschel M. and Martin A. and Weismantel R.},
 title = {The {S}teiner tree packing problem in {VLSI} design},
 journal = {Math. Program.},
 volume = {78},
 number = {2},
 year = {1997},
 issn = {0025-5610},
 pages = {265--281},
 doi = {http://dx.doi.org/10.1007/BF02614374},
 publisher = {Springer-Verlag New York, Inc.},
 address = {Secaucus, NJ, USA},
}


@ARTICLE{bahiense02,
   AUTHOR = "Bahiense L. and Maculan M. and Sagastizabal C.",
   TITLE = "{The Volume Algorithm revisited: Relation with bundle methods}",
   JOURNAL = "Math Programming",
   YEAR = "2002",
   VOLUME = "94",
   NUMBER = "1",
   MONTH = "",
   PAGES = "41--69"
}
@ARTICLE{barahona01,
   AUTHOR = "Barahona F. and Anbil R.",
   TITLE = "{The volume algorithm: producing primal solutions with a subgradient method}",
   JOURNAL = "Math Programming",
   YEAR = "2000",
   VOLUME = "87",
   NUMBER = "1",
   MONTH = "",
   PAGES = "385--399"
}
@ARTICLE{dionneflorian,
   AUTHOR = "Dionne R. and Florian M.",
   TITLE = "{Exact and approximate algorithms for optimal network design}",
   JOURNAL = "Networks",
   YEAR = "1979",
   VOLUME = "9",
   NUMBER = "1",
   MONTH = "",
   PAGES = "37--59"
}
@ARTICLE{bahiense01,
   AUTHOR = "Bahiense L. and Barahona F. and Porto O.",
   TITLE = "{The volume algorithm: producing primal solutions with a subgradient method}",
   JOURNAL = "Mathematical Programming",
   YEAR = "2003",
   VOLUME = "7",
   NUMBER = "",
   MONTH = "",
   PAGES = "259--282"
}

@ARTICLE{fischer01,
   AUTHOR = "Bahiense L. and Barahona F. and Porto O.",
   TITLE = "{The volume algorithm: producing primal solutions with a subgradient method}",
   JOURNAL = "Mathematical Programming",
   YEAR = "2003",
   VOLUME = "7",
   NUMBER = "",
   MONTH = "",
   PAGES = "259--282"
}

@inproceedings{moreno01,
 author = {Hansen P. and Mlad\'enovic N. and Moreno J.},
 title = {Variable Neighbourhood Search},
 booktitle = {Revista Iberoamericana de Inteligencia Artificial},
 number = {19},
 year = {2003},
 isbn = {1137-3601},
 pages = {77--92},
 doi = {http://www.aepia.org/revista},
 publisher = {AEPIA}
}

@inproceedings{melian01,
 author = {Meli\'an B.},
 title = {Using Memory to Improve the {VNS} Metaheuristic for the Design of {SDH/WDM} Networks},
 booktitle = {Hybrid Metaheuristics},
 year = {2006},
 isbn = {1611-3349},
 volume ={4030},
 pages = {82--93},
 doi = {10.1007/11890584},
 publisher = {Lecture Notes in Computer Science}
}

@BOOK{johnsonbaugh,
   author = "Johnsonbaugh R.",
   title= "Matem\'aticas Discretas",
   publisher = "Prentice Hall",
   year = 2005
}
@book{Grimaldi,
 author = {Grimaldi and Ralph P.},
 title = {Discrete and Combinatorial Mathematics: An Applied Introduction},
 year = {1998},
 isbn = {0201199122},
 publisher = {Addison-Wesley Longman Publishing Co., Inc.},
 address = {Boston, MA, USA},
 }

@article{acosteiner,
  author    = {Yu Hu and
               Tong Jing and
               Zhe Feng 0002 and
               Xianlong Hong and
               Xiaodong Hu and
               Guiying Yan},
  title     = {{ACO-S}teiner: Ant Colony Optimization Based Rectilinear {S}teiner
               Minimal Tree Algorithm},
  journal   = {J. Comput. Sci. Technol.},
  volume    = {21},
  number    = {1},
  year      = {2006},
  pages     = {147-152},
  ee        = {http://dx.doi.org/10.1007/s11390-006-0147-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{reduccionestabusteiner,
  author    = {Gendreau M. and Larochelle J. F. and Sans B.},
  title     = {A tabu search heuristic for the {S}teiner Tree Problem},
  journal   = {Networks},
  volume    = {34},
  number    = {2},
  year      = {1999},
  pages     = {162-172}
}
@TECHREPORT{steinlib,
   author      = " Koch T. and Martin A. and {Vo\ss} S.",
   title       = "{SteinLib}: An Updated Library on {S}teiner Tree Problems in Graphs",
   institution = "Konrad-Zuse-Zentrum {f\"ur} Informationstechnik Berlin",
   number      = "ZIB-Report 00-37",
   address     = "Takustr. 7, Berlin",
   year        = "2000",
   url         = "http://elib.zib.de/steinlib",
}

@book{winston01,
 author = {Winston, Wayne L.},
 title = {Investigacion de Operaciones: Aplicaciones y Algoritmos},
 year = {2006},
 isbn = {9706863621},
 publisher = {Thomson International},
 }

@book{cormen,
  address = {Cambridge, London},
  author = {Cormen T. and Leiserson C. and Rivest R. and Stein C.},
  edition = {2nd},
  interHash = {dcdeb0ec50a6798abf1724056982b543},
  intraHash = {d4a718b9ae12ed341c1a8c8bdf1cda91},
  publisher = {McGraw-Hill Book Company},
  title = {{Introduction to algorithms}},
  year = {2001},
  language = {american}
}
@INBOOK{alba01,
  AUTHOR =       {Alba E.  and Luque G.},
  TITLE =        {Parallel Metaheuristics: A New Class of Algorithms},
  CHAPTER =      {11. Parallel Variable Neighborhood Search},
  pages =        {247--267},
  PUBLISHER =    {Wiley},
  YEAR =         {2005},
  series =       {Wiley Series on Parallel and Distributed Computing}
}
@incollection{parallelvns01,
    abstract = {Variable Neighborhood Search (VNS) is a recently invented metaheuristic to use in solving combinatorial optimization problems in which a systematic change of neighborhood with a local search is carried out. However, as happens with other meta-heuristics, it sometimes takes long time to reach useful solutions whilst solving some sort of hard and large scale combinatorial problems such as job shop scheduling. One of the most considerable way out to overcome this shortcoming is to parallelize VNS implementations. In this chapter, firstly, a number of variable neighborhood search algorithms are examined for Job Shop Scheduling (JSS) problems and then four different parallelization policies are tackled as part of efficiency investigation for parallel VNS algorithms. The experimentation reveals the performance of various VNS algorithms and the efficiency of policies to follow in parallelization. In the end, a policy based on unidirectional-ring topology is found most efficient.},
    author = {Mehmet A. and Mehmet S.},
    citeulike-article-id = {4254659},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-78985-7_6},
    citeulike-linkout-1 = {http://www.springerlink.com/content/tx61017014412844},
    doi = {10.1007/978-3-540-78985-7_6},
    journal = {Metaheuristics for Scheduling in Industrial and Manufacturing Applications},
    keywords = {job, neighbourhood, scheduling, search, shop, variable},
    pages = {125--144},
    posted-at = {2009-04-01 23:32:06},
    priority = {2},
    title = {Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling},
    url = {http://dx.doi.org/10.1007/978-3-540-78985-7_6},
    year = {2008}
}
@book{talbi,
    author = {Talbi, El-Ghazali},
    citeulike-article-id = {5105232},
    citeulike-linkout-0 = {http://www.worldcat.org/oclc/230183356},
    isbn = {9780470278581},
    keywords = {antcolonyoptimization, artificialimmunesystems, beecolonies, evolutionaryalgorithm, localsearch, metaheuristic, particleswarmoptimization, simulatedannealing, tabusearch},
    posted-at = {2009-07-10 12:43:35},
    priority = {2},
    publisher = {John Wiley \& Sons},
    title = {Metaheuristics:~from design to implementation},
    url = {http://www.worldcat.org/oclc/230183356},
    year = {2009}
}
@book{tesisivan,
   author = {Acevedo I.},
   title = {Dise\~{n}o, Implementaci\'on y Evaluaci\'on de Propuetas Algor\'itmicas para el Problema de Steiner Robusto},
   publisher = {Memoria de título {I}ng. {C}ivil en {C}omputaci\'on Universidad de Talca},
   year = {2009},
}
@article{Warshall,
 author = {Warshall S.},
 title = {A Theorem on Boolean Matrices},
 journal = {J. ACM},
 volume = {9},
 number = {1},
 year = {1962},
 issn = {0004-5411},
 pages = {11--12},
 doi = {http://doi.acm.org/10.1145/321105.321107},
 publisher = {ACM},
 address = {New York, NY, USA},
 }
@mastersthesis{Paredes02,
  Author = {Paredes R.},
  Month = {Septiembre},
  Note = {In spanish. {\tt http://\-www.dcc.uchile.cl/\-\~{}raparede/\-publ/\-02tesisMagister.pdf}},
  School = {Departamento de Ciencias de la Computaci\'on, Universidad de Chile},
  Title = {Uso de $t$-Spanners para B\'usqueda en Espacios M\'etricos},
  Year = {2002}
}
@phdthesis{ParedesPhD,
  Author = {Paredes R.},
  Month = {July}, 
  Note = {Advisor: G.~{}Navarro. Dept. of Computer Science Tech Report TR/DCC-2008-10. Available at {\tt http://www.dcc.uchile.cl/\~{}raparede/publ/08PhDthesis.pdf}},
  School = {University of Chile, Chile},
  Title = {Graphs for Metric Space Searching},
  Year = {2008}
}
@book{tesismunozm,
  author = {Mu{\~n}oz A.},
  publisher = {Memoria de título {I}ng. {C}ivil {I}ndustrial Universidad de Talca},
  title = {An\'alisis de una heur\'istica integrada para el problema de Steiner en Redes},
  year = {2005}
}
@article{Ribeiro01,
 author = {Martins S. L. and Resende, M. G. C. and Ribeiro C. C. and Pardalos P. M.},
 title = {A Parallel Grasp for the {S}teiner Tree Problem in Graphs Using a Hybrid Local Search Strategy},
 journal = {Journal of Global Optimization},
 volume = {17},
 number = {1-4},
 year = {2000},
 issn = {0925-5001},
 pages = {267--283},
 doi = {http://dx.doi.org/10.1023/A:1026546708757},
 publisher = {Kluwer Academic Publishers},
 address = {Hingham, MA, USA},
 }
@INPROCEEDINGS{Ribeiro02,
    author = {Bastos M. P. and Ribeiro C. C.},
    title = {Reactive Tabu Search With Path Relinking For The {S}teiner Problem In Graphs},
    booktitle = {Proceedings of the Third Metaheuristics International Conference},
    year = {1999},
    pages = {31--36},
    publisher = {Kluwer}
}
@article{Ribeiro03,
 author = {Ribeiro C. C. and Uchoa E. and Werneck R. F.},
 title = {A Hybrid GRASP with Perturbations for the {S}teiner Problem in Graphs},
 journal = {INFORMS J. on Computing},
 volume = {14},
 number = {3},
 year = {2002},
 issn = {1526-5528},
 pages = {228--246},
 doi = {http://dx.doi.org/10.1287/ijoc.14.3.228.116},
 publisher = {INFORMS},
 address = {Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA},
 }
@techreport{RibeiroVND,
        author = "Ribeiro C. C.  and  Vianna D.S.",
        title = {A {GRASP}/{VND} heuristic for the phylogeny problem using
	         a new neighborhood structure},
        institution = {Department of Computer Science, Catholic U. of Rio
	               de Janeiro},
        address = "Rio de Janeiro, Brazil",
	annote = {The phylogeny problem consists in finding a phylogeny 
		with the minimum number of evolutionary steps, where a 
		phylogeny is a tree that relates taxonomic units based 
		on their similarity over a set of characters. 
		The authors propose a hybridization of {GRASP} and VND. 
		The greedy criterion is based on insertions of new taxons
                into a branch of the current partial solution.
		The local search phase uses a VND strategy and a new 
		neighborhood structure, called $2$-SPR and based on 
		the iterative removing of branches on the cuurent solution.},
        year = "2003"
}
@article{Resende02,
	author = {Resende M.G.C. and  Gonzalez-Velarde J.L.},
	title = {{GRASP: Procedimientos de b\'usqueda miope aleatorizado
	          y adaptativo}},
	journal = {Inteligencia Artificial},
   	year = {2003},
	number = {19},
	volume = {19},
	pages = {61--76}
}

@MISC{GRASP,
    author = {Resende M. G. C. and  Ribeiro C. C.},
    title = {Greedy Randomized Adaptive Search Procedures},
    year = {2002}
}
@article{dpsosteiner,
 author = {Consoli S. and Moreno J. A. and Darby-Dowman K. and Mlad\'enovic N.},
 title = {Discrete Particle Swarm Optimization for the minimum labelling {S}teiner tree problem},
 journal = {Natural Computing: an international journal},
 volume = {9},
 number = {1},
 year = {2010},
 issn = {1567-7818},
 pages = {29--46},
 doi = {http://dx.doi.org/10.1007/s11047-009-9137-9},
 publisher = {Kluwer Academic Publishers},
 address = {Hingham, MA, USA},
 }
@article{SASteiner,
 author = {Osborne L. J. and Gillett B. E.},
 title = {A Comparison of Two Simulated Annealing Algorithms Applied to the Directed {S}teiner Problem on Networks},
 journal = {ORSA {J}ournal on {C}omputing},
 volume = {3},
 number = {3},
 year = {1991},
 issn = {0899-1499},
 pages = {213--225},
 doi = {10.1287/ijoc.3.3.213},
 }
@book{handbook,
    author = {Glover F. W. and Kochenberger G. A.},
    citeulike-article-id = {620024},
    day = {01},
    howpublished = {Hardcover},
    isbn = {1402072635},
    keywords = {ant-colony-optimization, constraint-programming, genetic-algorithm, genetic-programming, grasp, memetic-algorithm, metaheuristic, neural-network, scatter-search, simulated-annealing, tabu-search, variable-neighborhood-search},
    month = {January},
    posted-at = {2007-09-05 15:38:01},
    priority = {2},
    publisher = {Springer},
    title = {Handbook of Metaheuristics (International Series in Operations Research \& Management Science)},
    url = {http://www.worldcat.org/isbn/1402072635},
    year = {2003}
}
@Article{DuinVolgenant,
  author={Duin C. and Volgenant  A.},
  title={Reducing the hierarchical network design problem},
  journal={European Journal of Operational Research},
  year=1989,
  volume={39},
  number={3},
  pages={332-344},
  month={April},
  keywords={},
  abstract={},
  url={http://ideas.repec.org/a/eee/ejores/v39y1989i3p332-344.html}
}
@ARTICLE{Uchoa99,
    author = {Uchoa E. and Arag{\~a}o M. P. and Ribeiro C. C.},
    title = {Preprocessing Steiner Problems from VLSI Layout},
    journal = {Networks},
    year = {1999},
    volume = {40},
    pages = {38--50}
}
@article{NPalgor09,
  TITLE = {On Sorting, Heaps, and Minimum Spanning Trees},
  AUTHOR = { Navarro G. and Paredes R.},
  JOURNAL = {Algorithmica},
  PUBLISHER = {Springer},
  NOTE = {doi:10.1007/s00453-010-9400-6},
  Volume = {57},
  number = {4},
  pages = {585--620},
  YEAR = {2010}
}
@book{SCRUM,
 author = {Kniberg H.},
 title = {Scrum and XP from the Trenches: Enterprise Software Development},
 year = {2007},
 isbn = {1430322640, 9781430322641},
 publisher = {Lulu.com},
 }


